Cordon pricing consistent with the physics of overcrowding

This paper describes the modeling of recurring congestion in a network. It is shown that the standard economic models of marginal cost cannot describe precisely traffic congestion in networks during time-dependent conditions. Following a macroscopic traffic approach, we describe the equilibrium solution for a congested network in the no-toll case. A dynamic model of cordon-based congestion pricing (such as for the morning commute) for networks is developed consistent with the physics of traffic.Ê The paper combines VickreyÕs theory with a macroscopic traffic model, which is readily observable with existing monitoring technologies. The paper also examines some policy implications of the cordon-based pricing to treat equity and reliability issues, i.e. in what mobility level a city should choose to operate. An application of the model in a downtown area shows that these schemes can improve mobility and relieve congestion in cities.Cordon Pricing, Congestion Pricing, Road Pricing, Value Pricing, Social Equity

Macroscopic modelling and robust control of bi-modal multi-region urban road networks

The paper concerns the integration of a bi-modal Macroscopic Fundamental Diagram (MFD) modelling for mixed traffic in a robust control framework for congested single- and multi-region urban networks. The bi-modal MFD relates the accumulation of cars and buses and the outflow (or circulating flow) in homogeneous (both in the spatial distribution of congestion and the spatial mode mixture) bi-modal traffic networks. We introduce the composition of traffic in the network as a parameter that affects the shape of the bi-modal MFD. A linear parameter varying model with uncertain parameter the vehicle composition approximates the original nonlinear system of aggregated dynamics when it is near the equilibrium point for single- and multi-region cities governed by bi-modal MFDs. This model aims at designing a robust perimeter and boundary flow controller for single- and multi-region networks that guarantees robust regulation and stability, and thus smooth and efficient operations, given that vehicle composition is a slow time-varying parameter. The control gain of the robust controller is calculated off-line using convex optimisation. To evaluate the proposed scheme, an extensive simulation-based study for single- and multi-region networks is carried out. To this end, the heterogeneous network of San Francisco where buses and cars share the same infrastructure is partitioned into two homogeneous regions with different modes of composition. The proposed robust control is compared with an optimised pre-timed signal plan and a single-region perimeter control strategy. Results show that the proposed robust control can significantly: (i) reduce the overall congestion in the network; (ii) improve the traffic performance of buses in terms of travel delays and schedule reliability, and; (iii) avoid queues and gridlocks on critical paths of the network

The Spatial Variability of Vehicle Densities as Determinant of Urban Network Capacity

Due to the complexity of the traffic flow dynamics in urban road networks, most quantitative descriptions of city traffic so far are based on computer simulations. This contribution pursues a macroscopic (fluid-dynamic) simulation approach, which facilitates a simple simulation of congestion spreading in cities. First, we show that a quantization of the macroscopic turning flows into units of single vehicles is necessary to obtain realistic fluctuations in the traffic variables, and how this can be implemented in a fluid-dynamic model. Then, we propose a new method to simulate destination flows without the requirement of individual route assignments. Combining both methods allows us to study a variety of different simulation scenarios. These reveal fundamental relationships between the average flow, the average density, and the variability of the vehicle densities. Considering the inhomogeneity of traffic as an independent variable can eliminate the scattering of congested flow measurements. The variability also turns out to be a key variable of urban traffic performance. Our results can be explained through the number of full links of the road network, and approximated by a simple analytical formula

Approximation methods for large-scale spatial queueing systems

Different than the conventional queueing systems, in spatial queueing systems (SQS) the service rate for each customer-server pairs differs and the server that intervenes for a specific customer is not known a priori, depending on the availability of servers at the moment a request was made. These features make the SQS computationally expensive (almost intractable for large scale) but at the same time more suitable for real-life problems with high reliability expectations. Emergency response and on-demand transportation systems are two similar systems that can be modeled with the SQS. In this research, we aim to solve facility location problems as SQS with stochastic demand and service time. The stochasticity concerned here is temporal and spatial, that emerges from the uncertainty in the demand and service time. In order to tackle this problem Larson (1974)'s 2n hypercube queueing model (HQM) is extended to 3n HQM. In this model, there are two different possible service types for each server: (i) service for locations in the proximity of a server (area of responsibility) and (ii) service for other locations where the first responsible server is busy during this event. In addition, to decrease the dimension of the problem, which is intractable due to their size, a new 3n aggregate hypercube queueing model (AHQM) is developed that treats group of servers (bins) in a similar manner by considering interactions among bins. An efficient graph partitioning algorithm is proposed to cluster servers in groups with an objective to minimize the interactions among groups. Both exact and approximate approaches are integrated inside two optimization methods (i.e. variable neighborhood search and simulated annealing) to find server locations that improve system performance. Computational experiments showed that both models are applicable to use inside optimization algorithms to find good server locations and to improve system performance measures of SQS

Modeling the morning commute for urban networks with cruising-for-parking: An MFD approach

This study focuses on the morning commute problem with explicit consideration of cruising-for-parking, and its adverse impacts on traffic congestion. The cruising-for-parking is modeled through a dynamic aggregated traffic model for networks: the Macroscopic Fundamental Diagram (MFD). Firstly, we formulate the commuting equilibrium in a congested downtown network where travelers have to cruise for curbside parking spaces. The cruising-for-parking would yield longer trip distance and smaller network outflow, and thus can induce severe congestion and lengthen the morning peak. We then develop a dynamic model of pricing for the network to reduce total social cost, which includes cruising time cost, moving time cost (moving or in-transit time, which is the duration during which vehicles move close to the destination but do not cruise for parking yet), and schedule delay cost. We show that under specific assumptions, at the system optimum, the downtown network should be operating at the maximum production of its MFD. However, the cruising effect is not fully eliminated. We also show that the time-dependent toll to support the system optimum has a different shape than the classical fine toll in Vickrey's bottleneck model. In the end, analytical results are illustrated and verified with numerical experiments

The Importance of Being Early

The assumption that the penalty for being early is less than that for being late was put forward by Vickrey (1963) who analyzed how commuters compare penalties in the form of schedule delay (due to peak hour congestion), against penalties in the form of reaching their destination (ahead or behind their desired time of arrival). This assumption has been tested by many researchers since then for various applications, especially in modeling congestion pricing (Arnott et al., 1990) where it is critical to understand the tradeoff between schedule delay and travel delay. Key findings are summarized in the second section of this paper. This research aims to test this hypothesis of earliness being less expensive than lateness using empirical data at different levels and across different regions. New methods to estimate the ratio of earliness to lateness for different types of datasets are developed, which could be used by agencies to implement control policies like congestion pricing or other schemes more accurately. Travel survey data from metropolitan areas provide individual travel patterns while loop detector data provide link level traffic flow data.Schedule Delay, Travel Time, Traffic, Travel Behavior.

On the inefficiency of ride-sourcing services towards urban congestion

The advent of shared-economy and smartphones made on-demand transportation services possible, which created additional opportunities, but also more complexity to urban mobility. Companies that offer these services are called Transportation Network Companies (TNCs) due to their internet-based nature. Although ride-sourcing is the most notorious service TNCs provide, little is known about to what degree its operations can interfere in traffic conditions, while replacing other transportation modes, or when a large number of idle vehicles is cruising for passengers. We experimentally analyze the efficiency of TNCs using taxi trip data from a Chinese megacity and a agent-based simulation with a trip-based MFD model for determining the speed. We investigate the effect of expanding fleet sizes for TNCs, passengers' inclination towards sharing rides, and strategies to alleviate urban congestion. We show that the lack of coordination of objectives between TNCs and society can create 37% longer travel times and significant congestion. Moreover, allowing shared rides is not capable of decreasing total distance traveled due to higher empty kilometers traveled. Elegant parking management strategies can prevent idle vehicles from cruising without assigned passengers and lower to 7% the impacts of the absence of coordination.Comment: Submitted to Transportation Research Part

A ride time-oriented scheduling algorithm for dial-a-ride problems

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theory, aims at finding minimal user ride time schedules in polynomial time. The algorithm can either return optimal feasible routes or it can return incorrect infeasibility declarations, on which feasibility can be recovered through a specifically-designed heuristic. The algorithm is furthermore supplemented by a battery management algorithm that can be used to determine charging decisions for electric and autonomous vehicle fleets. Timing solutions from the proposed scheduling algorithm are obtained on millions of routes extracted from DARP and e-ADARP benchmark instances. They are compared to those obtained from a linear program, as well as to popular scheduling procedures from the DARP literature. Results show that the proposed procedure outperforms state-of-the-art scheduling algorithms, both in terms of compute-efficiency and solution quality.Comment: 12 pages, 1 figur

Two-layer adaptive signal control framework for large-scale dynamically-congested networks: Combining efficient Max Pressure with Perimeter Control

Traffic-responsive signal control is a cost-effective and easy-to-implement network management strategy with high potential in improving performance in congested networks with dynamic characteristics. Max Pressure (MP) distributed controller gained significant popularity due to its theoretically proven ability of queue stabilization and throughput maximization under specific assumptions. However, its effectiveness under saturated conditions is questionable, while network-wide application is limited due to high instrumentation cost. Perimeter control (PC) based on the concept of the Macroscopic Fundamental Diagram (MFD) is a state-of-the-art aggregated strategy that regulates exchange flows between regions, in order to maintain maximum regional travel production and prevent over-saturation. Yet, homogeneity assumption is hardly realistic in congested states, thus compromising PC efficiency. In this paper, the effectiveness of network-wide, parallel application of PC and MP embedded in a two-layer control framework is assessed with mesoscopic simulation. Aiming at reducing implementation cost of MP without significant performance loss, we propose a method to identify critical nodes for partial MP deployment. A modified version of Store-and-forward paradigm incorporating finite queue and spill-back consideration is used to test different configurations of the proposed framework, for a real large-scale network, in moderately and highly congested scenarios. Results show that: (i) combined control of MP and PC outperforms separate MP and PC applications in both demand scenarios; (ii) MP control in reduced critical node sets leads to similar or even better performance compared to full-network implementation, thus allowing for significant cost reduction; iii) the proposed control schemes improve system performance even under demand fluctuations of up to 20% of mean.Comment: Submitted to Transportation Research Part C: Emerging Technologie